Linkage Query Writer
نویسندگان
چکیده
We present Linkage Query Writer (LinQuer), a system for generating SQL queries for semantic link discovery over relational data. The LinQuer framework consists of (a) LinQL, a language for specification of linkage requirements; (b) a web interface and an API for translating LinQL queries to standard SQL queries; (c) an interface that assists users in writing LinQL queries. We discuss the challenges involved in the design and implementation of a declarative and easy to use framework for discovering links between different data items in a single data source or across different data sources. We demonstrate different steps of the linkage requirements specification and discovery process in several real world scenarios and show how the LinQuer system can be used to create high-quality linked data sources.
منابع مشابه
Connected Component Based Word Spotting on Persian Handwritten image documents
Word spotting is to make searchable unindexed image documents by locating word/words in a doc-ument image, given a query word. This problem is challenging, mainly due to the large numberof word classes with very small inter-class and substantial intra-class distances. In this paper, asegmentation-based word spotting method is presented for multi-writer Persian handwritten doc-...
متن کاملInformation Retrieval Based Writer Identification
In this paper, we apply an Information Retrieval model for the writer identification task. A set of local features is defined by clustering the graphemes produced by a segmentation procedure. Then a textual based Information Retrieval model is applied. After a first indexation step, this model no longuer requires image access to the database for responding to a specific query, thus making the p...
متن کاملStructure-based Query Expansion for Xml Search Engine
Based on the query expansion techniques in information retrieval systems, structure-based query expansion for XML search engines, which is designed to ease the query for XML data while keeping the power and flexibility of XML query, is introduced in this paper. To enable the structure expansion, a structure thesaurus should be built first, which involves the construction of a weighted graph fro...
متن کاملof the article : Dynamic Maintenance of Kinematic Structures ∗
We study the following dynamic data structure problem: Given a collection of links connected by joints, efficiently maintain a data structure allowing quick answers to range queries, as the links move (the joint parameters change). To understand better, consider a serial linkage with n links, such as a classical manipulator arm. A query typically specifies a region occupied by an obstacle, and ...
متن کاملDependence Language Model for Information Retrieval1
This paper presents a new dependence language modeling approach to information retrieval. The approach extends the basic language modeling approach based on unigram by relaxing the independence assumption. We integrate the linkage of a query as a hidden variable, which expresses the term dependencies within the query as an acyclic, planar, undirected graph. We then assume that a query is genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- PVLDB
دوره 2 شماره
صفحات -
تاریخ انتشار 2009